SIMPLE algorithm - PDFSEARCH.IO - Document Search Engine

SIMPLE algorithm
Results: 168

#	Item
61	4. Applications Meisters’ [Me] Two-Ears Theorem was motivated by the problem of triangulating a simple polygon. In fact Meisters suggests a greedy, but concise algorithm to achieve this goal, i.e., “find Add to Reading List Source URL: www-cgrl.cs.mcgill.ca Language: English - Date: 2002-06-13 17:58:05
62	A fast and simple algorithm for training neural probabilistic language models Andriy Mnih Joint work with Yee Whye Teh Gatsby Computational Neuroscience Unit University College London Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2013-01-24 12:05:50
63	B 4. References 1 Bhattacharya B K, ElGindy H. A new linear convex hull algorithm for simple polygons. IEEE Transactions on Information Add to Reading List Source URL: www-cgrl.cs.mcgill.ca Language: English - Date: 2002-06-13 17:51:42
64	Homework 1 1) An Eulerian tour in a graph G is a non-necessarily simple cycle in G which passes through each edge of G exactly once. Design a fast algorithm for an Eulerian tour in a graph with all vertices of even degre Add to Reading List Source URL: fileadmin.cs.lth.se - Date: 2008-09-05 05:36:29
65	LEAPFROG TRIEJOIN: A SIMPLE, WORST-CASE OPTIMAL JOIN ALGORITHM TODD VELDHUIZEN // LOGICBLOX Add to Reading List Source URL: www.edbticdt2014.gr - Date: 2014-05-06 05:02:17
66	A simple algorithm to study phylogeographies & speciation patterns in space Philippe Desjardins-Proulx,1, 2, ∗ Timoth´ee Poisot,2 and Dominique Gravel2 1 College of Engineering, University of Illinois at Chicago, USA. Add to Reading List Source URL: timotheepoisot.fr Language: English
67	Distributed Colony-Level Algorithm Switching for Robot Swarm Foraging Nicholas Ho, Robert Wood, Radhika Nagpal Abstract Swarm robotics utilizes a large number of simple robots to accomplish a Add to Reading List Source URL: micro.seas.harvard.edu Language: English - Date: 2011-11-09 17:00:08
68	THE FLORIDA STATE UNIVERSITY COLLEGE OF ARTS AND SCIENCES A SIMPLE, THREAD-SAFE, APPROXIMATE NEAREST NEIGHBOR ALGORITHM Add to Reading List Source URL: www.cs.fsu.edu - Date: 2012-09-05 15:30:07
69	High frequency moments via max-stability Alexandr Andoni Microsoft Research SVC March 29, 2013 We present a simple algorithm for estimating the k > 2 frequency moment, or simply the Add to Reading List Source URL: www.mit.edu Language: English - Date: 2013-03-29 19:37:18
70	DELFT UNIVERSITY OF TECHNOLOGY REPORTSIMPLE-type preconditioners for the Oseen problem M. ur Rehman, Add to Reading List Source URL: www.ewi.tudelft.nl Language: English - Date: 2011-05-11 08:17:01 Computational science Preconditioner Partial differential equations Numerical analysis Computational fluid dynamics Iterative method Navier–Stokes equations Schur complement SIMPLE algorithm Numerical linear algebra Mathematics Mathematical analysis

UPDATE